maximizing sequence

См. также в других словарях:

• Matched filter — In telecommunications, a matched filter (originally known as a North filter[1]) is obtained by correlating a known signal, or template, with an unknown signal to detect the presence of the template in the unknown signal. This is equivalent to… …   Wikipedia

• Tetris — Tetяis redirects here. For the Tengen produced game, see TETЯIS: The Soviet Mind Game. Tetris The box of the Nintendo version of Tetris for the NES. Developer(s) Alexey Pajitnov (E60 prototype), Vadim Ge …   Wikipedia

• Odds algorithm — The odds algorithm is a mathematical method for computing optimal strategies for a class of problems that belong to the domain of optimal stopping problems. Their solution follows from the odds strategy, and the importance of the odds strategy… …   Wikipedia

• game theory — a mathematical theory that deals with strategies for maximizing gains and minimizing losses within prescribed constraints, as the rules of a card game: widely applied in the solution of various decision making problems, as those of military… …   Universalium

• optimization — /op teuh meuh zay sheuhn/ 1. the fact of optimizing; making the best of anything. 2. the condition of being optimized. 3. Math. a mathematical technique for finding a maximum or minimum value of a function of several variables subject to a set of …   Universalium

• river — river1 riverless, adj. riverlike, adj. /riv euhr/, n. 1. a natural stream of water of fairly large size flowing in a definite course or channel or series of diverging and converging channels. 2. a similar stream of something other than water: a… …   Universalium

• NACA airfoil — Profile geometry – 1: Zero lift line; 2: Leading edge; 3: Nose circle; 4: Camber; 5: Max. thickness; 6: Upper surface; 7: Trailing edge; 8: Camber mean line; 9: Lower surface …   Wikipedia

• Robust statistics — provides an alternative approach to classical statistical methods. The motivation is to produce estimators that are not unduly affected by small departures from model assumptions. Contents 1 Introduction 2 Examples of robust and non robust… …   Wikipedia

• 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

• Oligopoly — An oligopoly is a market form in which a market or industry is dominated by a small number of sellers (oligopolists). The word is derived, by analogy with monopoly , from the Greek ὀλίγοι (oligoi) few + πόλειν (pólein) to sell . Because there are …   Wikipedia

• Philosophical Explanations — is a wide ranging metaphysical, epistemological, and ethical treatise written by Robert Nozick and published in 1981. The Parthenon Model and non coercive philosophy Nozick makes a case for a Parthenon model of philosophical ambition rather than… …   Wikipedia